Coloring a Graph Using Split Decomposition
نویسنده
چکیده
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular we present an O(nm) algorithm to compute the chromatic number for all those graphs having a split decomposition in which every prime graph is an induced subgraph of either a Ck or a Ck for some k ≥ 3.
منابع مشابه
Revisiting the Layout Decomposition Problem for Double Patterning Lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures) if their spacing is less than the minimum coloring spacing. 11, 14 However, there exist pattern configurations for which pattern features separated by less than the minimum coloring spacing cannot be assigned different...
متن کاملOn the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...
متن کاملUsing Latin Squares to Color Split Graphs
An edge-coloring of a graph is an assignment of colors to its edges such that no adjacent edges have the same color. A split graph is a graph whose vertex set admits a partition into a stable set and a clique. Split graphs have been introduced by Földes and Hammer [4] and it is a well-studied class of graphs. However, the problem of deciding the chromatic index of any split graph remains unsolv...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004